Every generalized Petersen graph has a Tait coloring

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Errantum: Petersen graph has branchwidth 4

In my doctoral thesis [1], I claimed a proof that the branchwidth of the Petersen graph had branchwidth 5 and proceeded to prove that it was a member of the obstruction set for graphs with branchwidth at most 4. I have stated this claim in Hicks [2] and Hicks et al. [4]. There was, however, an error in the construction of the tangle used to prove the claim. The branchwidth of the Petersen graph...

متن کامل

SIGNED GENERALIZED PETERSEN GRAPH AND ITS CHARACTERISTIC POLYNOMIAL

Let G^s be a signed graph, where G = (V;E) is the underlying simple graph and s : E(G) to {+, -} is the sign function on E(G). In this paper, we obtain k-th signed spectral moment and k-th signed Laplacian spectral moment of Gs together with coefficients of their signed characteristic polynomial and signed Laplacian characteristic polynomial are calculated.

متن کامل

Every 4-Colorable Graph With Maximum Degree 4 Has an Equitable 4-Coloring

Chen, Lih, and Wu conjectured that for r ≥ 3, the only connected graphs with maximum degree at most r that are not equitably r-colorable are Kr,r (for odd r) and Kr+1. If true, this would be a joint strengthening of the Hajnal-Szemerédi Theorem and Brooks' Theorem. Chen, Lih, and Wu proved that their conjecture holds for r = 3. In this paper we study properties of the hypothetical minimum count...

متن کامل

Every Plane Graph of Maximum Degree 8 has an Edge-Face 9-Coloring

An edge-face colouring of a plane graph with edge set E and face set F is a colouring of the elements of E ∪ F such that adjacent or incident elements receive different colours. Borodin proved that every plane graph of maximum degree ∆ > 10 can be edge-face coloured with ∆ + 1 colours. Borodin’s bound was recently extended to the case where ∆ = 9. In this paper, we extend it to the case ∆ = 8.

متن کامل

Every rayless graph has an unfriendly partition

We prove that every rayless graph has an unfriendly partition.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Pacific Journal of Mathematics

سال: 1972

ISSN: 0030-8730,0030-8730

DOI: 10.2140/pjm.1972.40.53